Handling Exceptions in nonmonotonic reasoning

نویسندگان

  • Marcelino C. Pequeno
  • Rodrigo M. S. Veras
  • Wladimir A. Tavares
چکیده

We introduce some differences in the style defeasible information is represented and inferences are made in nonmonotonic reasoning. These, at first sight harmless, changes, in fact, helped us to discover a very important principle guiding how inferences should be drawn in nonmonotonic reasoning, we name it the exception-first principle or EFP. DLEF is our own variant for default logic complying with EFP. We also show alternative definitions for Reiter’s default logics and its justified and constrained variants within our framework. DLEF does not produce anomalous extensions where the other default logics do. Restricted to the language of general logic programs, DLEF, Reiter’s default logic and answer set programming all coincide. This explains why ASP is appointed as a solution to the anomalous extensions problem, ASP complies with EFP.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Combining Rule Learning and Nonmonotonic Reasoning for Link Prediction in Knowledge Graphs

Learning rules from knowledge graphs (KG) is a crucial task for KG completion, cleaning and curation. The majority of existing approaches are capable of learning only Horn rules from KGs, which are, however, insufficiently expressive for capturing exceptions and thus might make incorrect predictions on missing facts. In this paper we discuss our recent progress in addressing this limitation. Mo...

متن کامل

Jumping to Conclusions - A Logico-Probabilistic Foundation for Defeasible Rule-Based Arguments

A theory of defeasible arguments is proposed that combines logical and probabilistic properties. This logico-probabilistic argumentation theory builds on two foundational theories of nonmonotonic reasoning and uncertainty: the study of nonmonotonic consequence relations (and the associated minimal model semantics) and probability theory. A key result is that, in the theory, qualitatively define...

متن کامل

A Uniied Approach to Inheritance with Connicts

Nonmonotonic reasoning is reasoning which allows both a statement and its negation simultaneously to attain some degree of reliability. Such situations are called ambiguous. In this paper we investigate and describe a new approach for multiple inheritance with connict, which concentrates on nding the degree of plausibility of the statement and of its negation. We identify a new implicit default...

متن کامل

More on Inheritance Hierarchies with Exceptions: Default Theories and Inferential Distance

In Artificial Intelligence, well-understood reasoning systems and tractable reasoning systems have often seemed mutually exclusive. This has been exemplified by nonmonotonic reasoning formalisms and inheritance-with-exceptions reasoners. These have epitomized the two extremes: the former not even semidecidable, the latter completely ad hoc. We previously presented a formal mechanism for specify...

متن کامل

Logic in Nonmonotonic Reasoning

We present a conceptual description of nonmonotonic formalisms as essentially two-layered reasoning systems consisting of a monotonic logical system, coupled with a mechanism of a reasoned choice of default assumptions. On this ‘surgery’, the main features of a nonmonotonic formalism are determined by the interplay between its logical basis and the nonmonotonic overhead. Furthermore, it allows ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007